0.00/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.09 % Command : run_E %s %d THM 0.09/0.28 % Computer : n009.cluster.edu 0.09/0.28 % Model : x86_64 x86_64 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.28 % Memory : 8042.1875MB 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.28 % CPULimit : 1440 0.12/0.28 % WCLimit : 180 0.12/0.28 % DateTime : Thu Jul 4 09:56:38 EDT 2024 0.12/0.28 % CPUTime : 0.14/0.41 Running higher-order theorem proving 0.14/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.lkYOprj8OR/E---3.1_11747.p 0.14/0.45 # Version: 3.2.0-ho 0.14/0.45 # Preprocessing class: HSMSSMSSSSSNSFA. 0.14/0.45 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.14/0.45 # Starting new_ho_14 with 720s (4) cores 0.14/0.45 # Starting new_ho_13 with 360s (2) cores 0.14/0.45 # Starting new_ho_10_cnf2 with 180s (1) cores 0.14/0.45 # Starting new_bool_3 with 180s (1) cores 0.14/0.45 # new_bool_3 with pid 11855 completed with status 8 0.14/0.45 # new_ho_13 with pid 11853 completed with status 0 0.14/0.45 # Result found by new_ho_13 0.14/0.45 # Preprocessing class: HSMSSMSSSSSNSFA. 0.14/0.45 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.14/0.45 # Starting new_ho_14 with 720s (4) cores 0.14/0.45 # Starting new_ho_13 with 360s (2) cores 0.14/0.45 # No SInE strategy applied 0.14/0.45 # Search class: HGUSM-FFMF21-MSFFFSBN 0.14/0.45 # partial match(2): HGUSM-FFSF21-SSFFFSBN 0.14/0.45 # Scheduled 5 strats onto 2 cores with 360 seconds (360 total) 0.14/0.45 # Starting new_ho_14 with 217s (1) cores 0.14/0.45 # Starting new_ho_13 with 37s (1) cores 0.14/0.45 # new_ho_13 with pid 11863 completed with status 0 0.14/0.45 # Result found by new_ho_13 0.14/0.45 # Preprocessing class: HSMSSMSSSSSNSFA. 0.14/0.45 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.14/0.45 # Starting new_ho_14 with 720s (4) cores 0.14/0.45 # Starting new_ho_13 with 360s (2) cores 0.14/0.45 # No SInE strategy applied 0.14/0.45 # Search class: HGUSM-FFMF21-MSFFFSBN 0.14/0.45 # partial match(2): HGUSM-FFSF21-SSFFFSBN 0.14/0.45 # Scheduled 5 strats onto 2 cores with 360 seconds (360 total) 0.14/0.45 # Starting new_ho_14 with 217s (1) cores 0.14/0.45 # Starting new_ho_13 with 37s (1) cores 0.14/0.45 # Preprocessing time : 0.001 s 0.14/0.45 # Presaturation interreduction done 0.14/0.45 0.14/0.45 # Proof found! 0.14/0.45 # SZS status Theorem 0.14/0.45 # SZS output start CNFRefutation 0.14/0.45 thf(decl_sort1, type, nat: $tType). 0.14/0.45 thf(decl_sort2, type, set: $tType). 0.14/0.45 thf(decl_22, type, x: nat). 0.14/0.45 thf(decl_23, type, y: nat). 0.14/0.45 thf(decl_24, type, ts: nat > nat > nat). 0.14/0.45 thf(decl_25, type, esti: nat > set > $o). 0.14/0.45 thf(decl_26, type, setof: (nat > $o) > set). 0.14/0.45 thf(decl_27, type, n_1: nat). 0.14/0.45 thf(decl_28, type, suc: nat > nat). 0.14/0.45 thf(decl_29, type, pl: nat > nat > nat). 0.14/0.45 thf(decl_30, type, esk1_1: set > nat). 0.14/0.45 thf(satz29, conjecture, ((ts @ x @ y)=(ts @ y @ x)), file('/export/starexec/sandbox2/tmp/tmp.lkYOprj8OR/E---3.1_11747.p', satz29)). 0.14/0.45 thf(estii, axiom, ![X3:nat > $o, X4:nat]:(((X3 @ X4)=>(esti @ X4 @ (setof @ X3)))), file('/export/starexec/sandbox2/tmp/tmp.lkYOprj8OR/E---3.1_11747.p', estii)). 0.14/0.45 thf(ax5, axiom, ![X5:set]:(((esti @ n_1 @ X5)=>(![X1:nat]:((esti @ X1 @ X5))<=![X1:nat]:(((esti @ (suc @ X1) @ X5)<=(esti @ X1 @ X5)))))), file('/export/starexec/sandbox2/tmp/tmp.lkYOprj8OR/E---3.1_11747.p', ax5)). 0.14/0.45 thf(satz28c, axiom, ![X1:nat]:(((ts @ n_1 @ X1)=(X1))), file('/export/starexec/sandbox2/tmp/tmp.lkYOprj8OR/E---3.1_11747.p', satz28c)). 0.14/0.45 thf(satz28a, axiom, ![X1:nat]:(((ts @ X1 @ n_1)=(X1))), file('/export/starexec/sandbox2/tmp/tmp.lkYOprj8OR/E---3.1_11747.p', satz28a)). 0.14/0.45 thf(estie, axiom, ![X3:nat > $o, X4:nat]:(((X3 @ X4)<=(esti @ X4 @ (setof @ X3)))), file('/export/starexec/sandbox2/tmp/tmp.lkYOprj8OR/E---3.1_11747.p', estie)). 0.14/0.45 thf(satz28d, axiom, ![X1:nat, X2:nat]:(((ts @ (suc @ X1) @ X2)=(pl @ (ts @ X1 @ X2) @ X2))), file('/export/starexec/sandbox2/tmp/tmp.lkYOprj8OR/E---3.1_11747.p', satz28d)). 0.14/0.45 thf(satz28f, axiom, ![X1:nat, X2:nat]:(((pl @ (ts @ X1 @ X2) @ X1)=(ts @ X1 @ (suc @ X2)))), file('/export/starexec/sandbox2/tmp/tmp.lkYOprj8OR/E---3.1_11747.p', satz28f)). 0.14/0.45 thf(c_0_8, negated_conjecture, ((ts @ x @ y)!=(ts @ y @ x)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz29])])). 0.14/0.45 thf(c_0_9, plain, ![X24:nat > $o, X25:nat]:((~(X24 @ X25)|(esti @ X25 @ (setof @ X24)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[estii])])])). 0.14/0.45 thf(c_0_10, negated_conjecture, ((ts @ x @ y)!=(ts @ y @ x)), inference(fof_nnf,[status(thm)],[c_0_8])). 0.14/0.45 thf(c_0_11, plain, ![X5:set]:(((esti @ n_1 @ X5)=>(![X1:nat]:(((esti @ X1 @ X5)=>(esti @ (suc @ X1) @ X5)))=>![X1:nat]:((esti @ X1 @ X5))))), inference(fof_simplification,[status(thm)],[ax5])). 0.14/0.45 thf(c_0_12, plain, ![X3:nat > $o, X1:nat]:(((esti @ X1 @ (setof @ X3))|~((X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.14/0.45 thf(c_0_13, negated_conjecture, ((ts @ x @ y)!=(ts @ y @ x)), inference(split_conjunct,[status(thm)],[c_0_10])). 0.14/0.45 thf(c_0_14, plain, ![X31:nat]:(((ts @ n_1 @ X31)=(X31))), inference(variable_rename,[status(thm)],[satz28c])). 0.14/0.45 thf(c_0_15, plain, ![X19:nat]:(((ts @ X19 @ n_1)=(X19))), inference(variable_rename,[status(thm)],[satz28a])). 0.14/0.45 thf(c_0_16, plain, ![X26:set, X28:nat]:((((esti @ (esk1_1 @ X26) @ X26)|(esti @ X28 @ X26)|~(esti @ n_1 @ X26))&(~(esti @ (suc @ (esk1_1 @ X26)) @ X26)|(esti @ X28 @ X26)|~(esti @ n_1 @ X26)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])])])). 0.14/0.45 thf(c_0_17, plain, ![X1:nat]:(((esti @ X1 @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x))))))|((ts @ x @ X1)!=(ts @ X1 @ x)))), inference(trigger,[status(thm)],[inference(cn,[status(thm)],[]), c_0_12, c_0_13])). 0.14/0.45 thf(c_0_18, plain, ![X1:nat]:(((ts @ n_1 @ X1)=(X1))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.14/0.45 thf(c_0_19, plain, ![X1:nat]:(((ts @ X1 @ n_1)=(X1))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.14/0.45 thf(c_0_20, plain, ![X3:nat > $o, X4:nat]:(((esti @ X4 @ (setof @ X3))=>(X3 @ X4))), inference(fof_simplification,[status(thm)],[estie])). 0.14/0.45 thf(c_0_21, plain, ![X1:nat, X5:set]:(((esti @ (esk1_1 @ X5) @ X5)|(esti @ X1 @ X5)|~((esti @ n_1 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_16])). 0.14/0.45 thf(c_0_22, plain, (esti @ n_1 @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x)))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])])). 0.14/0.45 thf(c_0_23, plain, ![X29:nat > $o, X30:nat]:((~(esti @ X30 @ (setof @ X29))|(X29 @ X30))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])). 0.14/0.45 thf(c_0_24, plain, ![X1:nat]:(((esti @ (esk1_1 @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x)))))) @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x))))))|(esti @ X1 @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x)))))))), inference(spm,[status(thm)],[c_0_21, c_0_22])). 0.14/0.45 thf(c_0_25, plain, ![X20:nat, X21:nat]:(((ts @ (suc @ X20) @ X21)=(pl @ (ts @ X20 @ X21) @ X21))), inference(variable_rename,[status(thm)],[satz28d])). 0.14/0.45 thf(c_0_26, plain, ![X1:nat, X3:nat > $o]:(((X3 @ X1)|~((esti @ X1 @ (setof @ X3))))), inference(split_conjunct,[status(thm)],[c_0_23])). 0.14/0.45 thf(c_0_27, plain, (esti @ (esk1_1 @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x)))))) @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x)))))), inference(ef,[status(thm)],[c_0_24])). 0.14/0.45 thf(c_0_28, plain, ![X22:nat, X23:nat]:(((pl @ (ts @ X22 @ X23) @ X22)=(ts @ X22 @ (suc @ X23)))), inference(variable_rename,[status(thm)],[satz28f])). 0.14/0.45 thf(c_0_29, plain, ![X1:nat, X2:nat]:(((ts @ (suc @ X1) @ X2)=(pl @ (ts @ X1 @ X2) @ X2))), inference(split_conjunct,[status(thm)],[c_0_25])). 0.14/0.45 thf(c_0_30, plain, ((ts @ (esk1_1 @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x)))))) @ x)=(ts @ x @ (esk1_1 @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x)))))))), inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27])])). 0.14/0.45 thf(c_0_31, plain, ![X1:nat, X2:nat]:(((pl @ (ts @ X1 @ X2) @ X1)=(ts @ X1 @ (suc @ X2)))), inference(split_conjunct,[status(thm)],[c_0_28])). 0.14/0.45 thf(c_0_32, plain, ![X1:nat, X5:set]:(((esti @ X1 @ X5)|~((esti @ (suc @ (esk1_1 @ X5)) @ X5))|~((esti @ n_1 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_16])). 0.14/0.45 thf(c_0_33, plain, ((ts @ (suc @ (esk1_1 @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x))))))) @ x)=(ts @ x @ (suc @ (esk1_1 @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x))))))))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31])). 0.14/0.45 thf(c_0_34, plain, ![X1:nat]:(((esti @ X1 @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x))))))|~((esti @ (suc @ (esk1_1 @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x))))))) @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x))))))))), inference(spm,[status(thm)],[c_0_32, c_0_22])). 0.14/0.45 thf(c_0_35, plain, (esti @ (suc @ (esk1_1 @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x))))))) @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x)))))), inference(spm,[status(thm)],[c_0_17, c_0_33])). 0.14/0.45 thf(c_0_36, plain, ![X1:nat]:((((ts @ x @ X1)=(ts @ X1 @ x))|~((esti @ X1 @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x))))))))), inference(trigger,[status(thm)],[inference(cn,[status(thm)],[]), c_0_26, c_0_13])). 0.14/0.45 thf(c_0_37, plain, ![X1:nat]:((esti @ X1 @ (setof @ (^[Z0/* 3 */:nat]:(((ts @ x @ Z0)=(ts @ Z0 @ x))))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_35])])). 0.14/0.45 thf(c_0_38, plain, ![X1:nat]:(((ts @ x @ X1)=(ts @ X1 @ x))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36, c_0_37])])). 0.14/0.45 thf(c_0_39, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_38])]), ['proof']). 0.14/0.45 # SZS output end CNFRefutation 0.14/0.45 # Parsed axioms : 18 0.14/0.45 # Removed by relevancy pruning/SinE : 0 0.14/0.45 # Initial clauses : 19 0.14/0.45 # Removed in clause preprocessing : 10 0.14/0.45 # Initial clauses in saturation : 17 0.14/0.45 # Processed clauses : 187 0.14/0.45 # ...of these trivial : 7 0.14/0.45 # ...subsumed : 18 0.14/0.45 # ...remaining for further processing : 162 0.14/0.45 # Other redundant clauses eliminated : 0 0.14/0.45 # Clauses deleted for lack of memory : 0 0.14/0.45 # Backward-subsumed : 5 0.14/0.45 # Backward-rewritten : 30 0.14/0.45 # Generated clauses : 410 0.14/0.45 # ...of the previous two non-redundant : 218 0.14/0.45 # ...aggressively subsumed : 0 0.14/0.45 # Contextual simplify-reflections : 0 0.14/0.45 # Paramodulations : 397 0.14/0.45 # Factorizations : 8 0.14/0.45 # NegExts : 0 0.14/0.45 # Equation resolutions : 4 0.14/0.45 # Disequality decompositions : 0 0.14/0.45 # Total rewrite steps : 321 0.14/0.45 # ...of those cached : 135 0.14/0.45 # Propositional unsat checks : 0 0.14/0.45 # Propositional check models : 0 0.14/0.45 # Propositional check unsatisfiable : 0 0.14/0.45 # Propositional clauses : 0 0.14/0.45 # Propositional clauses after purity: 0 0.14/0.45 # Propositional unsat core size : 0 0.14/0.45 # Propositional preprocessing time : 0.000 0.14/0.45 # Propositional encoding time : 0.000 0.14/0.45 # Propositional solver time : 0.000 0.14/0.45 # Success case prop preproc time : 0.000 0.14/0.45 # Success case prop encoding time : 0.000 0.14/0.45 # Success case prop solver time : 0.000 0.14/0.45 # Current number of processed clauses : 109 0.14/0.45 # Positive orientable unit clauses : 90 0.14/0.45 # Positive unorientable unit clauses: 8 0.14/0.45 # Negative unit clauses : 0 0.14/0.45 # Non-unit-clauses : 11 0.14/0.45 # Current number of unprocessed clauses: 51 0.14/0.45 # ...number of literals in the above : 61 0.14/0.45 # Current number of archived formulas : 0 0.14/0.45 # Current number of archived clauses : 53 0.14/0.45 # Clause-clause subsumption calls (NU) : 106 0.14/0.45 # Rec. Clause-clause subsumption calls : 95 0.14/0.45 # Non-unit clause-clause subsumptions : 0 0.14/0.45 # Unit Clause-clause subsumption calls : 562 0.14/0.45 # Rewrite failures with RHS unbound : 0 0.14/0.45 # BW rewrite match attempts : 1870 0.14/0.45 # BW rewrite match successes : 42 0.14/0.45 # Condensation attempts : 0 0.14/0.45 # Condensation successes : 0 0.14/0.45 # Termbank termtop insertions : 19502 0.14/0.45 # Search garbage collected termcells : 140 0.14/0.45 0.14/0.45 # ------------------------------------------------- 0.14/0.45 # User time : 0.023 s 0.14/0.45 # System time : 0.004 s 0.14/0.45 # Total time : 0.026 s 0.14/0.45 # Maximum resident set size: 1892 pages 0.14/0.45 0.14/0.45 # ------------------------------------------------- 0.14/0.45 # User time : 0.054 s 0.14/0.45 # System time : 0.022 s 0.14/0.45 # Total time : 0.076 s 0.14/0.45 # Maximum resident set size: 1724 pages 0.14/0.45 % E---3.1 exiting 0.14/0.46 % E exiting 0.14/0.46 EOF